Free-Variable Axiomatic Foundations of Infinitesimal Analysis: A Fragment with Finitary Consistency Proof
نویسندگان
چکیده
$
منابع مشابه
Fragment of Nonstandard Analysis with a Finitary Consistency Proof
We introduce a nonstandard arithmetic NQA− based on the theory developed by R. Chuaqui and P. Suppes in [2] (we will denote it by NQA+), with a weakened external open minimization schema. A finitary consistency proof for NQA− formalizable in PRA is presented. We also show interesting facts about the strength of the theories NQA− and NQA+; NQA− is mutually interpretable with I∆0 + EXP, and on th...
متن کاملJohn von Neumann and Hilbert's School of Foundations of Mathematics∗
The aim of the paper is to describe main achievements of John von Neumann in the foundations of mathematics and to indicate his connections with Hilbert's School. In particular we shall discuss von Neumann's contributions to the axiomatic set theory, his proof of the consistency of a fragment of the arithmetic of natural numbers and his discovery (independent of Gödel) of the second incompleten...
متن کاملProof Theory
Proof theory began in the 1920’s as a part of Hilbert’s program, which aimed to secure the foundations of mathematics by modeling infinitary mathematics with formal axiomatic systems and proving those systems consistent using restricted, finitary means. The program thus viewed mathematics as a system of reasoning with precise linguistic norms, governed by rules that can be described and studied...
متن کاملHilbert’s Program Then and Now
Hilbert’s program was an ambitious and wide-ranging project in the philosophy and foundations of mathematics. In order to “dispose of the foundational questions in mathematics once and for all,” Hilbert proposed a two-pronged approach in 1921: first, classical mathematics should be formalized in axiomatic systems; second, using only restricted, “finitary” means, one should give proofs of the co...
متن کاملProof systems for Moss' coalgebraic logic
We study Gentzen-style proof theory of the finitary version of the coalgebraic logic introduced by L. Moss. The logic captures the behaviour of coalgebras for a large class of set functors. The syntax of the logic, defined uniformly with respect to a finitary coalgebraic type functor T , uses a single modal operator ∇T of arity given by the functor T itself, and its semantics is defined in term...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Log.
دوره 60 شماره
صفحات -
تاریخ انتشار 1995